Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels
نویسندگان
چکیده
A conceptually simple method for derivation of lower bounds on the error exponent of specific families of block codes used on classical-quantum channels with arbitrary signal states over a finite Hilbert space is presented. It is shown that families of binary block codes with appropriately rescaled binomial multiplicity enumerators used on binary classical-quantum channels and decoded by the suboptimal decision rule introduced by Holevo attain the expurgated and cutoff rate lower bounds on the error exponent.
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
The performance of non-binary linear block codes is studied in this paper via the derivation of new upper bounds on the error probability under ML decoding. The transmission of these codes is assumed to take place over a memoryless and symmetric channel. The new bounds, which rely on the Gallager bounding technique, are applied to expurgated ensembles of non-binary and regular low-density parit...
متن کاملQuantum Sphere-Packing Bounds with Polynomial Prefactors
We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...
متن کاملExponential bounds on error probability with Feedback
Feedback is useful in memoryless channels for decreasing complexity and increasing reliability; the capacity of the memoryless channels, however, can not be increased by feedback. For fixed length block codes even the decay rate of error probability with block length does not increase with feedback for most channel models. Consequently for making the physical layer more reliable for higher laye...
متن کاملGallager's Exponent Analysis of STBC MIMO Systems over η-μ and κ-μ Fading Channels
In this paper, we analytically investigate Gallager’s exponent for space-time block codes over multiple-input multipleoutput block-fading channels with Gaussian input distribution. As a suitable metric of the fundamental tradeoff between communication reliability and information rate, Gallager’s exponent can be used to determine the required codeword length to achieve a prescribed error probabi...
متن کاملError Exponents Analysis of Dual-hop \eta-\mu and \kappa-\mu Fading Channel with Amplify-and-Forward Relaying
In this study, the authors investigate the Gallager’s error exponents of dual-hop amplify-and-forward systems over generalised η-μ and κ-μ fading channels, two versatile channel models which encompass a number of popular fading channels such as Rayleigh, Rician, Nakagami-m, Hoyt and one-sided Gaussian fading channels. The authors present new analytical expressions for the probability density fu...
متن کامل